for t in range(int(input())):
n=int(input())
a=list(map(int, input().split()))
m=int(input())
print(a[sum(map(int, input().split()))%n])
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
#define sort(v) sort(v.begin(),v.end())
#define ll long long
ll mod=1e9+7;
ll power(ll a,ll b){
if(a==0)return 1;
ll ans=power(a/2,b);
ans*=ans;
ans%=mod;
if(a%2)ans*=b;
ans%=mod;
return ans;
}
ll mul(ll a,ll b){
return ((a%mod)*(b%mod))%mod;
}
int main(){
int t;
cin>>t;
while(t--){
int n;
cin>>n;
vector<ll> v(n);
for(int i=0;i<n;i++)cin>>v[i];
int m;
ll s=0;
cin>>m;
for(int i=0;i<m;i++){
ll x;
cin>>x;
s+=x;
}
s=s%n;
cout<<v[s]<<endl;
}
return 0;
}
749A - Bachgold Problem | 1486B - Eastern Exhibition |
1363A - Odd Selection | 131B - Opposites Attract |
490C - Hacking Cypher | 158B - Taxi |
41C - Email address | 1373D - Maximum Sum on Even Positions |
1574C - Slay the Dragon | 621A - Wet Shark and Odd and Even |
1395A - Boboniu Likes to Color Balls | 1637C - Andrew and Stones |
1334B - Middle Class | 260C - Balls and Boxes |
1554A - Cherry | 11B - Jumping Jack |
716A - Crazy Computer | 644A - Parliament of Berland |
1657C - Bracket Sequence Deletion | 1657B - XY Sequence |
1009A - Game Shopping | 1657A - Integer Moves |
230B - T-primes | 630A - Again Twenty Five |
1234D - Distinct Characters Queries | 1183A - Nearest Interesting Number |
1009E - Intercity Travelling | 1637B - MEX and Array |
224A - Parallelepiped | 964A - Splits |